International Workshop on Quantified Boolean Formulas 2013 1 Informal Workshop Report 2

We propose Q(D)-resolution, a proof system for Quantified BooleanFormulas. Q(D)-resolution is a generalization of Q-resolution parameterized bya dependency scheme D. This system is closely related to search-based QCNFsolvers that use dependency schemes to generalize the QDPLL algorithm, suchas DepQBF. We prove thatQ(D)-resolution is sound by presenting a transfor-mation of Q(D)-resolution refutations into ordinary Q-resolution refutations,where D denotes the so-called Standard Dependency Scheme.